Generalized Flow and Determinism in Measurement-based Quantum Computation

We extend the notion of quantum information flow defined by Danos and Kashefi for the one-way model and present a necessary and sufficient condition for the deterministic computation in this model. The generalized flow also applied in the extended model with measurements in the X-Y, X-Z and Y-Z planes. We apply both measurement calculus and the stabiliser formalism to derive our main theorem which for the first time gives a full characterization of the deterministic computation in the one-way model. We present several examples to show how our result improves over the traditional notion of flow, such as geometries (entanglement graph with input and output) with no flow but having generalized flow and we discuss how they lead to an optimal implementation of the unitaries. More importantly one can also obtain a better quantum computation depth with the generalized flow rather than with flow. We believe our characterization result is particularly essential for the study of the algorithms and complexity in the one-way model.Comment: 16 pages, 10 figure

Generalized Flow and Determinism in Measurement-based Quantum Computation

We extend the notion of quantum information flow defined by Danos and Kashefi for the one-way model and present a necessary and sufficient condition for the deterministic computation in this model. The generalized flow also applied in the extended model with measurements in the X-Y, X-Z and Y-Z planes. We apply both measurement calculus and the stabiliser formalism to derive our main theorem which for the first time gives a full characterization of the deterministic computation in the one-way model. We present several examples to show how our result improves over the traditional notion of flow, such as geometries (entanglement graph with input and output) with no flow but having generalized flow and we discuss how they lead to an optimal implementation of the unitaries. More importantly one can also obtain a better quantum computation depth with the generalized flow rather than with flow. We believe our characterization result is particularly essential for the study of the algorithms and complexity in the one-way model.Comment: 16 pages, 10 figure

Brokered Graph State Quantum Computing

We describe a procedure for graph state quantum computing that is tailored to fully exploit the physics of optically active multi-level systems. Leveraging ideas from the literature on distributed computation together with the recent work on probabilistic cluster state synthesis, our model assigns to each physical system two logical qubits: the broker and the client. Groups of brokers negotiate new graph state fragments via a probabilistic optical protocol. Completed fragments are mapped from broker to clients via a simple state transition and measurement. The clients, whose role is to store the nascent graph state long term, remain entirely insulated from failures during the brokerage. We describe an implementation in terms of NV-centres in diamond, where brokers and clients are very naturally embodied as electron and nuclear spins.Comment: 5 pages, 3 figure

Cluster state preparation using gates operating at arbitrary success probabilities

Several physical architectures allow for measurement-based quantum computing using sequential preparation of cluster states by means of probabilistic quantum gates. In such an approach, the order in which partial resources are combined to form the final cluster state turns out to be crucially important. We determine the influence of this classical decision process on the expected size of the final cluster. Extending earlier work, we consider different quantum gates operating at various probabilites of success. For finite resources, we employ a computer algebra system to obtain the provably optimal classical control strategy and derive symbolic results for the expected final size of the cluster. We identify two regimes: When the success probability of the elementary gates is high, the influence of the classical control strategy is found to be negligible. In that case, other figures of merit become more relevant. In contrast, for small probabilities of success, the choice of an appropriate strategy is crucial.Comment: 7 pages, 9 figures, contribution to special issue of New J. Phys. on "Measurement-Based Quantum Information Processing". Replaced with published versio

Completeness of classical spin models and universal quantum computation

We study mappings between distinct classical spin systems that leave the partition function invariant. As recently shown in [Phys. Rev. Lett. 100, 110501 (2008)], the partition function of the 2D square lattice Ising model in the presence of an inhomogeneous magnetic field, can specialize to the partition function of any Ising system on an arbitrary graph. In this sense the 2D Ising model is said to be "complete". However, in order to obtain the above result, the coupling strengths on the 2D lattice must assume complex values, and thus do not allow for a physical interpretation. Here we show how a complete model with real -and, hence, "physical"- couplings can be obtained if the 3D Ising model is considered. We furthermore show how to map general q-state systems with possibly many-body interactions to the 2D Ising model with complex parameters, and give completeness results for these models with real parameters. We also demonstrate that the computational overhead in these constructions is in all relevant cases polynomial. These results are proved by invoking a recently found cross-connection between statistical mechanics and quantum information theory, where partition functions are expressed as quantum mechanical amplitudes. Within this framework, there exists a natural correspondence between many-body quantum states that allow universal quantum computation via local measurements only, and complete classical spin systems.Comment: 43 pages, 28 figure

Measurement-based quantum computation in a 2D phase of matter

Recently it has been shown that the non-local correlations needed for measurement based quantum computation (MBQC) can be revealed in the ground state of the Affleck-Kennedy-Lieb-Tasaki (AKLT) model involving nearest neighbor spin-3/2 interactions on a honeycomb lattice. This state is not singular but resides in the disordered phase of ground states of a large family of Hamiltonians characterized by short-range-correlated valence bond solid states. By applying local filtering and adaptive single particle measurements we show that most states in the disordered phase can be reduced to a graph of correlated qubits that is a scalable resource for MBQC. At the transition between the disordered and Neel ordered phases we find a transition from universal to non-universal states as witnessed by the scaling of percolation in the reduced graph state.Comment: 8 pages, 6 figures, comments welcome. v2: published versio

Experimental Quantum Teleportation of a Two-Qubit Composite System

Quantum teleportation, a way to transfer the state of a quantum system from one location to another, is central to quantum communication and plays an important role in a number of quantum computation protocols. Previous experimental demonstrations have been implemented with photonic or ionic qubits. Very recently long-distance teleportation and open-destination teleportation have also been realized. Until now, previous experiments have only been able to teleport single qubits. However, since teleportation of single qubits is insufficient for a large-scale realization of quantum communication and computation2-5, teleportation of a composite system containing two or more qubits has been seen as a long-standing goal in quantum information science. Here, we present the experimental realization of quantum teleportation of a two-qubit composite system. In the experiment, we develop and exploit a six-photon interferometer to teleport an arbitrary polarization state of two photons. The observed teleportation fidelities for different initial states are all well beyond the state estimation limit of 0.40 for a two-qubit system. Not only does our six-photon interferometer provide an important step towards teleportation of a complex system, it will also enable future experimental investigations on a number of fundamental quantum communication and computation protocols such as multi-stage realization of quantum-relay, fault-tolerant quantum computation, universal quantum error-correction and one-way quantum computation.Comment: 16pages, 4 figure

Multiparty hierarchical quantum-information splitting

We propose a scheme for multiparty hierarchical quantum-information splitting (QIS) with a multipartite entangled state, where a boss distributes a secret quantum state to two grades of agents asymmetrically. The agents who belong to different grades have different authorities for recovering boss's secret. Except for boss's Bell-state measurement, no nonlocal operation is involved. The presented scheme is also shown to be secure against eavesdropping. Such a hierarchical QIS is expected to find useful applications in the field of modern multipartite quantum cryptography.Comment: 6 pages, 2 table

Bipartite Entanglement in Continuous-Variable Cluster States

We present a study of the entanglement properties of Gaussian cluster states, proposed as a universal resource for continuous-variable quantum computing. A central aim is to compare mathematically-idealized cluster states defined using quadrature eigenstates, which have infinite squeezing and cannot exist in nature, with Gaussian approximations which are experimentally accessible. Adopting widely-used definitions, we first review the key concepts, by analysing a process of teleportation along a continuous-variable quantum wire in the language of matrix product states. Next we consider the bipartite entanglement properties of the wire, providing analytic results. We proceed to grid cluster states, which are universal for the qubit case. To extend our analysis of the bipartite entanglement, we adopt the entropic-entanglement width, a specialized entanglement measure introduced recently by Van den Nest M et al., Phys. Rev. Lett. 97 150504 (2006), adapting their definition to the continuous-variable context. Finally we add the effects of photonic loss, extending our arguments to mixed states. Cumulatively our results point to key differences in the properties of idealized and Gaussian cluster states. Even modest loss rates are found to strongly limit the amount of entanglement. We discuss the implications for the potential of continuous-variable analogues of measurement-based quantum computation.Comment: 22 page

Efficient and long-lived quantum memory with cold atoms inside a ring cavity

Quantum memories are regarded as one of the fundamental building blocks of linear-optical quantum computation and long-distance quantum communication. A long standing goal to realize scalable quantum information processing is to build a long-lived and efficient quantum memory. There have been significant efforts distributed towards this goal. However, either efficient but short-lived or long-lived but inefficient quantum memories have been demonstrated so far. Here we report a high-performance quantum memory in which long lifetime and high retrieval efficiency meet for the first time. By placing a ring cavity around an atomic ensemble, employing a pair of clock states, creating a long-wavelength spin wave, and arranging the setup in the gravitational direction, we realize a quantum memory with an intrinsic spin wave to photon conversion efficiency of 73(2)% together with a storage lifetime of 3.2(1) ms. This realization provides an essential tool towards scalable linear-optical quantum information processing.Comment: 6 pages, 4 figure